A Neighbor Coverage Based Probabilistic Rebroadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks

Traditional routing protocols in Mobile Ad hoc Network (MANET) send periodic messages to realize the changes in topology. Sending periodic messages cause overhead. Compared to proactive routing protocols, reactive routing protocols can cause less overhead. Broadcasting can cause broadcast storm problem .To discover the route better than broadcasting methodology rebroadcast can done with the help of neighbor knowledge methods. We propose neighbor coverage based probabilistic rebroadcast protocol for reducing routing overhead in MANETs. In order to effectively exploit the neighbor coverage knowledge, we propose a novel rebroadcast delay to determine the rebroadcast order, and then we can obtain the more accurate additional coverage ratio by sensing neighbor coverage knowledge. We also define a connectivity factor to provide the node density adaptation. This approach can significantly decrease the number of retransmissions so as to reduce the routing overhead and also improve the routing performance. Thus finding the neighborhood node, we use channel awareness mechanism for data transmission and to improve the quality. General Terms-Wireless Networks, Mobile Ad hoc Networks. Keywords-Neighbor Coverage, Network Connectivity, Probabilistic Rebroadcast, Routing Overhead.